Increasing the readability of graph drawings with centrality-based scaling

نویسندگان

  • Damian Merrick
  • Joachim Gudmundsson
چکیده

A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networks can result in drawings that are not highly readable in the dense areas. Additionally, networks whose layouts are defined geographically often have dense areas that are located within small geographical regions relative to the size of the entire network. In cases where relationships within these dense areas are of interest, it is desirable to be able to distort the graph layout such that the denser areas are enlarged from their original sizes. In this paper, we propose a technique for enlarging dense areas of a given graph layout, and shrinking sparse areas. This technique is applied to geographical layouts of railway networks and force-directed layouts of non-geographical networks. The results show an increase in readability of dense parts of the networks. In addition, they provide improved starting layouts for schematisation methods which may be used to further increase readability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Force-Directed Graph Drawing Using Social Gravity and Scaling

Force-directed layout algorithms produce graph drawings by resolving a system of emulated physical forces. We present techniques for using social gravity as an additional force in force-directed layouts, together with a scaling technique, to produce drawings of trees and forests, as well as more complex social networks. Social gravity assigns mass to vertices in proportion to their network cent...

متن کامل

Improving Graph Drawing Readability by Incorporating Readability Metrics: A Software Tool for Network Analysts

Designing graph drawings that effectively communicate the underlying network is challenging as for every network there are many potential unintelligible or even misleading drawings. Automated graph layout algorithms have helped, but frequently generate ineffective drawings. In order to build awareness of effective graph drawing strategies, we detail readability metrics on a [0,1] continuous sca...

متن کامل

On the Usability of Lombardi Graph Drawings

A recent line of work in graph drawing studies Lombardi drawings, i.e., drawings with circular-arc edges and perfect angular resolution at vertices. Little has been known about the effects of curved edges versus straight edges in typical graph reading tasks. In this paper we present the first user evaluation that empirically measures the readability of three different layout algorithms (traditi...

متن کامل

A Radial Adaption of the Sugiyama Framework for Hierarchical Graph Drawing

In radial drawings of hierarchical graphs the vertices are drawn on concentric circles instead of on horizontal lines as in the standard Sugiyama framework. This drawing style is well suited for the visualisation of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two...

متن کامل

A Radial Adaptation of the Sugiyama Framework for Hierarchical Graph Drawing

In radial drawings of hierarchical graphs the vertices are drawn on concentric circles instead of on horizontal lines as in the standard Sugiyama framework. This drawing style is well suited for the visualisation of centrality in social networks and similar concepts. Radial drawings also allow a more flexible edge routing than horizontal drawings, as edges can be routed around the center in two...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006